Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples
نویسندگان
چکیده
We present some contributions to the theory of infinitary rewriting for weakly orthogonal term rewrite systems, in which critical pairs may occur provided they are trivial. We show that the infinitary unique normal form property (UN) fails by an example of a weakly orthogonal TRS with two collapsing rules. By translating this example, we show that UN also fails for the infinitary λβη-calculus. As positive results we obtain the following: Infinitary confluence, and hence UN, holds for weakly orthogonal TRSs that do not contain collapsing rules. To this end we refine the compression lemma. Furthermore, we establish the triangle and diamond properties for infinitary multi-steps (complete developments) in weakly orthogonal TRSs, by refining an earlier cluster-analysis for the finite case. 1998 ACM Subject Classification: D.1.1, D.3.1, F.4.1, F.4.2, I.1.1, I.1.3.
منابع مشابه
Unique Normal Forms in Infinitary Weakly Orthogonal Term Rewriting
We present some contributions to the theory of infinitary rewriting for weakly orthogonal term rewrite systems, in which critical pairs may occur provided they are trivial. We show that the infinitary unique normal form property (UN∞) fails by a simple example of a weakly orthogonal TRS with two collapsing rules. By translating this example, we show that UN∞ also fails for the infinitary λβη-ca...
متن کاملWeak Convergence and Uniform Normalization in Infinitary Rewriting
We study infinitary term rewriting systems containing finitely many rules. For these, we show that if a weakly convergent reduction is not strongly convergent, it contains a term that reduces to itself in one step (but the step itself need not be part of the reduction). Using this result, we prove the starkly surprising result that for any orthogonal system with finitely many rules, the system ...
متن کاملCounterexamples in infinitary rewriting with non-fully-extended rules
We show counterexamples exist to confluence modulo hypercollapsing subterms, fair normalisation, and the normal form property in orthogonal infinitary higherorder rewriting with non-fully-extended rules. This sets these systems apart from both fully-extended and finite systems, where no such counterexamples are possible.
متن کاملConfluence of nearly orthogonal infinitary term rewriting systems
We give a relatively simple coinductive proof of confluence, modulo equivalence of root-active terms, of nearly orthogonal infinitary term rewriting systems. Nearly orthogonal systems allow certain root overlaps, but no non-root overlaps. Using a slightly more complicated method we also show confluence modulo equivalence of hypercollapsing terms. The condition we impose on root overlaps is simi...
متن کاملInfinitary Normalization
In infinitary orthogonal first-order term rewriting the properties confluence (CR), Uniqueness of Normal forms (UN), Parallel Moves Lemma (PML) have been generalized to their infinitary versions CR∞, UN∞, PML∞, and so on. Several relations between these properties have been established in the literature. Generalization of the termination properties, Strong Normalization (SN) and Weak Normalizat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Logical Methods in Computer Science
دوره 10 شماره
صفحات -
تاریخ انتشار 2014